Secure broadcast in distributed networks with strong adversaries

نویسندگان

  • Pawel Szalachowski
  • Tiffany Hyun-Jin Kim
چکیده

This paper proposes a framework that enables secure one-to-many communication for networks with limited capabilities in the face of a strong adversary that can capture an arbitrary set of nodes. Our approach consists of two main components: (a) group key establishment protocol and (b) special key management. Especially, we try to address the following question: How strong of security properties can we achieve for broadcast communication in hardware-limited networks with a strong adversary? We propose approaches and their variants that neither require special hardware nor use costly cryptographic operations. With thorough security and efficiency analyses, we discuss how our solutions can be applied to a variety of hardware-limited distributed systems. We also describe the implementation and evaluation results of the most promising variants. Copyright © 2015 John Wiley & Sons, Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward an energy efficient PKC-based key management system for wireless sensor networks

Due to wireless nature and hostile environment, providing of security is a critical and vital task in wireless sensor networks (WSNs). It is known that key management is an integral part of a secure network. Unfortunately, in most of the previous methods, security is compromised in favor of reducing energy consumption. Consequently, they lack perfect resilience and are not fit for applications ...

متن کامل

Asynchronous Secure Communication Tolerating Mixed Adversaries

We study the problem of secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We al...

متن کامل

Broadcast from Minicast Secure Against General Adversaries

Byzantine broadcast is a distributed primitive that allows a specific party to consistently distribute a message among n parties in the presence of potential misbehavior of up to t of the parties. The celebrated result of [PSL80] shows that broadcast is achievable from point-to-point channels if and only if t < n/3. The following two generalizations have been proposed to the original broadcast ...

متن کامل

Round-Efficient Secure Computation in Point-to-Point Networks

Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round complexity when compiled for a point-to-point network due to the high overhead of emulating each invocation of broadcast. This problem is compounded when broadcast is used in more than one round of the origina...

متن کامل

Complete Characterization of AdversariesTolerable in Secure Multi - Party Computation

The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Security and Communication Networks

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2015